Fault-Tolerant Routing on the Star Graph with Safety Vectors
نویسندگان
چکیده
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances of two pairs of nodes are the same. Thus, on star graphs, we define the safety vector based on the routing path patterns. Based on the concept of routing path patterns, we first define the undirected safety vector, which is a one-dimensional vector on each node. In addition, we propose some methods for solving some problems on the safety vectors of the star graph, such as the length of safety vectors and the ranking of the routing path patterns.
منابع مشابه
An Adaptive Heuristic Algorithm with the Probabilistic Safety Vector for Fault-Tolerant Routing on the (n, k)-Star Graph
The (n, k)-star graph is a generalization of the n-star graph. It has better scalability than the n-star graph and holds some good properties compared with the hypercube. This paper focuses on the design of the fault-tolerant routing algorithm for the (n, k)-star graph. We adopt the idea of collecting the limited global information used for routing on the n-star graph to the (n, k)-star graph. ...
متن کاملA Fault-tolerant Routing Algorithm based on Safety Levels in a Hyper-Star Graph
A hyper-star graph HS(n, k) provides a promising topology for interconnection networks of parallel processing systems because it combines the merits of a hypercube and a star graph. In this study, we propose a fault-tolerant routing algorithm that establishes a fault-free path between any pair of non-faulty nodes in an HS(n, k) with faulty nodes by using limited global information called safety...
متن کاملA Routing Algorithm for the Star Interconnection Network in the Presence of Faults*
This paper presents a fault tolerant routing algorithm for the star graph. The suggested algorithm is based on the concept of unsafety vectors, originally proposed for hypercubes. In this algorithm, each node starts by computing a first level unsafety set, composed of the set of unreachable neighbors. It then performs some exchanges with its neighbors to determine the unsafety nodes. After that...
متن کاملFault-tolerant Routing based on Routing Capabilities in a Hyper-Star Graph
A hyper-star graph HS(n,k) provides a promising topology for interconnection networks of parallel processing systems because it inherits the advantages of a hypercube and a star graph. In this paper, we focus on fault-tolerant routing in an HS(n,k) graph with faulty nodes and propose an algorithm to establish a fault-free path between a pair of non-faulty nodes. The algorithm uses limited globa...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کامل